An algorithmic study of the Maximum Flow problem: A comparative statistical analysis

In this paper, we show the results of an experimental study about the most important algorithms proposed to solve the Maximum Flow problem. The appropriate statistical analysis not only allows us to justify comparisons between the different procedures but also to obtain classifications of their practical efficiency. Furthermore, an empirical experiment allows us to identify the influence of several parameters that are not included in a theoretical study.     

基于Visual Basic 的面向对象的编程方法

本文从作为可视化编程和对象技术的Ｖｉｓｕａｌ Ｂａｓｉｃ语言的核心－对象着手，着重讨论了各种对象的特点，创建各种对象所采用的方法以及使用的场合，探讨了基于Ｖｉｓｕａｌ Ｂａｓｉｃ的面向对象的编程方法。     

Growth and raman scattering of aluminium gallium orthophosphate piezoelectric crystals

A new series of non-ferroelectric crystals, the piezoelectric solid solution aluminium gallium orthophosphate Al_1-xGa_xPO₄ (AGP, 0 < x < 1) system has been successfully developed by a hydrothermal method. The AGP crystal with X = 0.10 shows a phase transition temperature T_−β = 587 ± 3 °C with a cell parameters A = b = 0.49386(3) and C = 1.09563(2) nm. Raman spectra including directional dispersion in AGP are similar to those from -AIPO4 and -quartz crystals, indicating all of them belong to an isomorphic family, the short-range interaction being dominant in AGP. Comparison with -AIPO4 crystals, there exists an apparent red shift of the mode frequency and a smaller TO/LO mode splitting of the E species in the AGP crystals.     

CaBa-铝酸盐玻璃中Cr4+谱线宽度随温度的变化

测量了15~300K温度范围内57.5%Al_1.5O-35%CaO-7.5%BaO玻璃中四价铬的发射光谱.这种材料中铬离子的能级处于Tanabe-Sugano图上弱场范围中,最低的激发态是³T₂,发射谱是一个宽带.按照单频近似理论拟合低温下的光谱,得到³T₂能级的零声子线位置E_zp=8400cm^-1,声子能量tω=320cm^-1,黄昆因子S=358.尽管单频近似能够较好地描述低温下的线形,发射光谱宽度随温度的变化却与单频近似理论的结果不符.讨论了这种差别的原因,认为可能的解释是与激发态耦合的声子能量大于与基态耦合的声子能量.     

A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP Method

A technique for maintaining the positive definiteness of the matrices in the quasi-Newton version of the SQP algorithm is proposed. In our algorithm, matrices approximating the Hessian of the augmented Lagrangian are updated. The positive definiteness of these matrices in the space tangent to the constraint manifold is ensured by a so-called piecewise line-search technique, while their positive definiteness in a complementary subspace is obtained by setting the augmentation parameter. In our experiment, the combination of these two ideas leads to a new algorithm that turns out to be more robust and often improves the results obtained with other approaches.     

Test Problem Generator by Neural Network for Algorithms that Try Solving Nonlinear Programming Problems Globally

A test problem generator, by means of neural networks nonlinear function approximation capability, is given in this paper which provides test problems, with many predetermined local minima and a global minimum, to evaluate nonlinear programming algorithms that are designed to solve the problem globally.     

拟似然非线性模型的某些渐近推断:几何方法

Abstract. A modified Bates and Watts geometric framework is proposed for quasi-likelihoodnonlinear models in Euclidean inner product space. Based on the modified geometric framework,some asymptotic inference in terms of curvatures for quasi-likelihood nonlinear models is stud-ied. Several previous results for nonlinear regression models and exponential family nonlinearmodels etc. are extended to quasi-likelihood nonlinear models.     

Even-aged restrictions with sub-graph adjacency

Restrictions on the size and proximity of clearcuts have led to the development of a variety of exact and heuristic methods to optimize the net present value of timber harvests, subject to adjacency constraints. Most treat harvest units as pre-defined, and impose adjacency constraints on any two units sharing a common border. By using graph theory notation to define sub-graph adjacency constraints, opening size can be considered variable, which may be more appropriate for landscape-level planning. A small example data set is used in this paper to demonstrate the difference between the two types of adjacency constraints for both integer programming and heuristic solution methods.     

神经网络在非线性规划中的应用

本文对蔡少棠[1 ] ,[2 ] 等提出的非线性规划神经网络作了改进 ,使得该神经网络适合于通用VLSI技术实现 .